Sufficient Conditions for Order-Independency in Sequential Thinning
نویسندگان
چکیده
منابع مشابه
Sufficient Conditions for Order-Independency in Sequential Thinning
The main issue of this paper is to introduce some conditions for templatebased sequential thinning that are capable of producing the same skeleton for a given binary image, independent of the visiting order of object points. As an example, we introduce two order-independent thinning algorithms for 2D binary images that satisfy these conditions.
متن کاملOrder–independent Sequential Thinning in Arbitrary Dimensions
Skeletons are region based shape descriptors that play important role in shape representation. This paper introduces a novel sequential thinning approach for n-dimensional binary objects (n = 1, 2, 3, . . .). Its main strength lies in its order–independency, i.e., it can produce the same skeletons for any visiting orders of border points. Furthermore, this is the first scheme in this field that...
متن کاملSufficient Conditions for Topological Order in Insulators
– We prove the existence of low energy excitations in insulating systems at general filling factor under certain conditions, and discuss in which cases these may be identified as topological excitations. In the specific case of half-filling this proof provides a significantly shortened proof of the recent higher dimensional Lieb-Schultz-Mattis theorem. The classic 1961 result of Lieb, Schultz, ...
متن کاملThinning algorithms based on sufficient conditions for topology preservation
Description: Thinning is a widely used pre–processing step in digital image processing and pattern recognition. It is an iterative layer by layer erosion until only the "skeletons" of the objects are left. Thinning algorithms are generally constructed in the following way: first the thinning strategy and the deletion rules are figured out, then the topological correctness is proved. In the case...
متن کاملAn Order-Independent Sequential Thinning Algorithm
Thinning is a widely used approach for skeletonization. Sequential thinning algorithms use contour tracking: they scan border points and remove the actual one if it is not designated a skeletal point. They may produce various skeletons for different visiting orders. In this paper, we present a new 2-dimensional sequential thinning algorithm, which produces the same result for arbitrary visiting...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Cybernetica
سال: 2011
ISSN: 0324-721X
DOI: 10.14232/actacyb.20.1.2011.7